Detailed visualization of communication network topologies
نویسندگان
چکیده
منابع مشابه
Random graph models of communication network topologies
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes limiting to infinity has been considered. It was found that an interesting structure appears. It has resemblance with such graphs like the Internet graph. Som...
متن کاملModeling the Performance of Communication Schemes on Network Topologies
This paper investigates the influence of the interconnection network topology of a parallel system on the delivery time of an ensemble of messages, called the communication scheme. More specifically, we focus on the impact on the performance of structure in network topology and communication scheme. We introduce causal structure learning algorithms for the modeling of the communication time. Th...
متن کاملTowards Communication-Aware Robust Topologies
We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., ProjecToR) and demandaware overlay networks (e.g., SplayNets). This paper introduces a formal framework and approach to reason about and design such topologies. We leverage a connection between the communication frequenc...
متن کاملSuperpositional Quantum Network Topologies
We introduce superposition-based quantum networks composed of (i) the classical perceptron model of multilayered, feedforward neural networks and (ii) the algebraic model of evolving reticular quantum structures as described in quantum gravity. The main feature of this model is moving from particular neural topologies to a quantum metastructure which embodies many differing topological patterns...
متن کاملGenetically Modified Network Topologies
We present a mechanism for constructing networks with a given set of parameters using genetic algorithms. The tunable parameters include number of nodes, number of links, clustering coefficient, entropy and average distance. It is shown that the effects of maximizing entropy while constraining the number of links reproduces an exponential degree distribution, as can be seen in many real network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.342